Methods for Solving Discrete Optimization Problems
نویسندگان
چکیده
منابع مشابه
Solving Impulsive Control Problems by Discrete-Time Dynamic Optimization Methods
In many classes of continuous-time control problems coming from real world applications, control actions in the shape of jumps at certain instants can be useful to be considered. This technique is called impulsive control. The main idea is to split the continuous-time interval in some stages, performing control actions impulsively just in the instants among the stages, with the dynamic system k...
متن کاملMethods for solving the bilevel optimization problems
1. Introduction. Nowadays, the bilevel optimization problems, arising in various applications [1, 2], seem to be one of the most attractive fields for many experts [1, 3, 4, 5]. Bilevel problems are such optimization problems, which – side by side with ordinary constraints such as equalities and inequalities [6] – include a constraint described as an optimization subproblem, called the lower-le...
متن کاملFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملSome Iterative Methods for Solving Equilibrium Problems and Optimization Problems
We introduce a new iterative scheme for finding a common element of the set of solutions of the equilibrium problems, the set of solutions of variational inequality for a relaxed cocoercive mapping, and the set of fixed points of a nonexpansive mapping. The results presented in this paper extend and improve some recent results of Ceng and Yao 2008 , Yao 2007 , S. Takahashi andW. Takahashi 2007 ...
متن کاملDiscrete Optimization Models for Solving Complex Products Design Problems
The development and research of discrete optimization models with logical, resource and other constraints to solve complex products design problems are continued in the article. These models are based on the SAT problem and its generalizations. Particular attention is paid to the questions of design of series of products using special sets of components (”kernels”) that have been suggested by t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions on Transport Sciences
سال: 2012
ISSN: 1802-971X,1802-9876
DOI: 10.2478/v10158-012-0009-0